Fast Polar Cosine Transform for Image Description
نویسندگان
چکیده
Polar Cosine Transform (PCT) is one of the Polar Harmonic Transforms that those kernels are basic waves and harmonic in nature. They are proposed to represent invariant patterns for two dimensional image description and are demonstrated to show superiorities comparing with other methods on extracting rotation invariant patterns for images. However in order to increase the computation speed, fast algorithm for PCT is proposed for real world applications like limited computing environments, large image databases and realtime systems. Based on our previous work, this paper novelly employs relative prime number theory to develop Fast Polar Cosine Transform (FPCT). The proposed FPCT is averagely over 11 ∼ 12.5 times faster than PCT that significantly boost computation process. The experimental results are given to illustrate the effectiveness of the proposed method.
منابع مشابه
Empirical Analysis of Invariance of Transform Coefficients under Rotation
Rotationally invariant transforms, namely, angular radial transform and polar harmonic transforms such as polar cosine transform, polar sine transform and polar complex exponential transforms, are used to characterize image features for a number of applications like logo recognition, face recognition etc. But the computation of features using these transforms is an expensive process due to thei...
متن کاملOptimal approximation of uniformly rotated images: relationship between Karhunen-Loeve expansion and discrete cosine transform
We present the concept that for uniformly rotated images, the optimal approximation of the images can be obtained by computing the basis vectors for the discrete cosine transform (DCT) of the original image in polar coordinates, and that the images can be represented as linear combinations of the basis vectors.
متن کاملDiscrete Cosine Transform
Discrete frequency transforms provide a method to obtain a global view of data within a window. Discrete cosine transform is the frequency transform for practical image processing because of its excellent energy compaction property. Another reason for its popularity is the existence of a fast implementation for the algorithm. In this article, the basics of the discrete cosine transform, its use...
متن کاملRotation Invariant Face Recognition Based on Hybrid LPT/DCT Features
The recognition of human faces, especially those with different orientations is a challenging and important problem in image analysis and classification. This paper proposes an effective scheme for rotation invariant face recognition using Log-Polar Transform and Discrete Cosine Transform combined features. The rotation invariant feature extraction for a given face image involves applying the l...
متن کاملField programmable gate array (FPGA) realization of a fast 2-D discrete cosine transform algorithm for higher image compression
This paper describes the field programmable gate array (FPGA) implementation of a fast 2-D discrete cosine transform (DCT) chip for higher image compression ratio. The development of encoding and decoding parts of 2-D DCT algorithm is carried out by using Matlab simulation tools and VHSIC hardware descriptive language (VHDL). Comparisons of results for higher image compression ratio as obtained...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011